Nearly Optimal Three Dimensional Layout of Hypercube Networks
نویسندگان
چکیده
In this paper we consider the three-dimensional layout of hypercube networks. Namely, we study the problem of laying hypercube networks out on the three-dimensional grid with the properties that all nodes are represented as rectangular slices and lie on two opposite sides of the bounding box of the layout volume. We present both a lower bound and a layout method providing an upper bound on the layout volume and the maximum wire-length of the hypercube network.
منابع مشابه
Fault-Tolerant Wavelength Allocations in All-optical Hypercubes
Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of nding an optimal (with respect to the least possible number of wavelengths) set of f + 1 internally node disjoint dipaths for every pair of distinct nodes in the binary r-dimensional hypercube, where 0 f < r. This system of dipaths serves as a routing protocol that remains functional in the presenc...
متن کاملOn Three-Dimensional Layout of Interconnection Networks (Extended Abstract) *
Abs t r ac t . In this paper we deal with the layout of interconnection networks on three-dimensional grids. In particular, in the first, part we prove a general formula for calculating an exact value for the lower bound on the volume. Then we introduce the new notion of k-3D double channel routing and we use it to exhibit an optimal three-dimensional layout for butterfly networks. Finally, we ...
متن کاملLayout Area of the Hypercube
In this paper we study the square grid area required for laying out H l , the Boolean hypercube of N = 2 l vertices. It is shown that this area is 4 9 N 2 + o(N 2). We describe a layout which occupies this much area and prove that no layout of less area exists.
متن کاملNode-disjoint paths and related problems on hierarchical cubic networks
An n-dimensional hierarchical cubic network (denoted by HCN(n)) contains 2 n n-dimensional hypercubes. The diameter of the HCN(n), which is equal to n+(n+1)/3+1, is about two-thirds the diameter of a comparable hypercube, although it uses about half as many links per node. In this paper, a maximal number of node-disjoint paths are constructed between every two distinct nodes of the HCN(n). Th...
متن کاملA Design Methodology for Three - dimensional Space - invariant Hypercube Networks Using Graph Bipartitioning
We present a new design methodology for constructing three-dimensional space-invariant hypercube interconnection networks. The methodology is based on a graph bipartitioning technique and allows the construction of larger hypercube networks from smaller networks in a systematic and incremental fashion. Due to its totally space-invariant nature, the resulting three-dimensional hypercube networks...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Networks
دوره 47 شماره
صفحات -
تاریخ انتشار 2003